Morphic characterizations of languages in Chomsky hierarchy with insertion and locality
نویسندگان
چکیده
منابع مشابه
Representations and Characterizations of Languages in Chomsky Hierarchy by Means of Insertion-Deletion Systems
Insertion-deletion operations are much investigated in linguistics and in DNA computing and several characterizations of Turing computability were obtained in this framework. In this note we contribute to this research direction with a new characterization of this type, as well as with representations of regular and context-free languages, mainly starting from context-free insertion systems of ...
متن کاملMorphic Characterizations of Language Families in Terms of Insertion Systems and Star Languages
Insertion systems have a unique feature in that only string insertions are allowed, which is in marked contrast to a variety of the conventional computing devices based on string rewriting. This paper will mainly focus on those systems whose insertion operations are performed in a context-free fashion, called context-free insertion systems, and obtain several characterizations of language famil...
متن کاملNatural Languages And The Chomsky Hierarchy
The central claim of the paper is that NL stringsets are regular. Three independent arguments are offered in favor of this position: one based on parsimony considerations, one employing the McCullogh-Pitts (1943) model of neurons, and a purely linguistic one. It is possible to derive explicit upper bounds for the number of (live) states in NL acceptors: the results show that finite state NL par...
متن کاملAn Insertion into the Chomsky Hierarchy?
This review paper will report on some recent discoveries in the area of Formal Languages, chie y by F. Otto, G. Buntrock and G. Niemann. These discoveries have pointed out certain break-throughs connected with the concept of growing contextsensitive languages, which originated in the 1980's with a paper by E. Dahlhaus and M.K. Warmuth. One important result is that the deterministic growing cont...
متن کاملOn Chomsky Hierarchy of Palindromic Languages
The characterization of the structure of palindromic regular and palindromic context-free languages is described by S. Horváth, J. Karhumäki, and J. Kleijn in 1987. In this paper alternative proofs are given for these characterizations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2011
ISSN: 0890-5401
DOI: 10.1016/j.ic.2010.11.011